#include <stdio.h>
int partition(int data[],int low,int height){
    int ls=data[low];
    while(low<height){
        while (height>low&&ls<=data[height]){
            height--;
        }
        data[low]=data[height];
        while (height>low&&data[low]<=ls)
        {
            low++;
        }
        data[height]=data[low];   
    }
    data[low]=ls;
    return low;
}
void quick(int *data,int low,int height){
    if(height>low){
        int privor=partition(data,low,height);
        quick(data,low,privor-1);
        quick(data,privor+1,height);
    }
}